Uniform Distributed Pushdown Automata Systems.

We consider here uniform distributed pushdown automata systems (UDPAS), namely distributed pushdown automata systems having all components identical pushdown automata. We consider here just a single protocol for activating/deactivating components, namely a component stays active as long as it can perform moves, as well as two ways of accepting the input word: by empty stacks (all components have empty stacks) or by final states (all components are in final states), when the input word is completely read. We mainly investigate the computational power of UDPAS accepting by empty stacks and a few decidability and closure properties of the families of languages they define. Some directions for further work and open problems are also discussed

Static Analysis of Usefulness States in Transition P systems

Transition P Systems are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P Systems evolve through transitions between two consecutive configurations that are determined by the membrane structure and multisets present inside membranes. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of evolution rules. But, to establish the rules to be applied, it is required the previous calculation of useful, applicable and active rules. Hence, computation of useful evolution rules is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in every evolution step. This work defines usefulness states through an exhaustive analysis of the P system for every membrane and for every possible configuration of the membrane structure during the computation. Moreover, this analysis can be done in a static way; therefore membranes only have to check their usefulness states to obtain their set of useful rules during execution

Networks of Polarized Evolutionary Processors as Problem Solvers.

In this paper, we propose a solution to an NP-complete problem, namely the "3-colorability problem", based on a network of polarized processors. Our solution is uniform and time efficient

Delimited Massively Parallel Algorithm based on Rules Elimination for Application of Active Rules in Transition P Systems

In the field of Transition P systems implementation, it has been determined that it is very important to determine in advance how long takes evolution rules application in membranes. Moreover, to have time estimations of rules application in membranes makes possible to take important decisions related to hardware/software architectures design. The work presented here introduces an algorithm for applying active evolution rules in Transition P systems, which is based on active rules elimination. The algorithm complies the requisites of being nondeterministic, massively parallel, and what is more important, it is time delimited because it is only dependant on the number of membrane evolution rules

Networks of polarized evolutionary processors are computationally complete

ABSTRACT In this paper, we consider the computational power of a new variant of networks of evolutionary processors which seems to be more suitable for a software and hardware implementation. Each processor as well as the data navigating throughout the network are now considered to be polarized. While the polarization of every processor is predefined, the data polarization is dynamically computed by means of a valuation mapping. Consequently, the protocol of communication is naturally defined by means of this polarization. We show that tag systems can be simulated by these networks with a constant number of nodes, while Turing machines can be simulated, in a time-efficient way, by these networks with a number of nodes depending linearly on the tape alphabet of the Turing machine

An Architecture forRepresenting Biological Processes based on Networks of Bio-inspired Processors

n this paper we propose the use of Networks of Bio-inspired Processors (NBP) to model some biological phenomena within a computational framework. In particular, we propose the use of an extension of NBP named Network Evolutionary Processors Transducers to simulate chemical transformations of substances. Within a biological process, chemical transformations of substances are basic operations in the change of the state of the cell. Previously, it has been proved that NBP are computationally complete, that is, they are able to solve NP complete problems in linear time, using massively parallel computations. In addition, we propose a multilayer architecture that will allow us to design models of biological processes related to cellular communication as well as their implications in the metabolic pathways. Subsequently, these models can be applied not only to biological-cellular instances but, possibly, also to configure instances of interactive processes in many other fields like population interactions, ecological trophic networks, in dustrial ecosystems, etc

Simulating Metabolic Processes Using an Architecture Based on Networks of Bio-inspired Processors.

In this work, we propose the Networks of Evolutionary Processors (NEP) [2] as a computational model to solve problems related with biological phenomena. In our first approximation, we simulate biological processes related with cellular signaling and their implications in the metabolism, by using an architecture based on NEP (NEP architecture) and their specializations: Networks of Polarized Evolutionary Processors (NPEP) [1] and NEP Transducers (NEPT) [3]. In particular, we use this architecture to simulate the interplay between cellular processes related with the metabolism as the Krebs cycle and the malate-aspartate shuttle pathway (MAS) both being altered by signaling by calcium

Networks of Bio-inspired Processors

The goal of this work is twofold. Firstly, we propose a uniform view of three types of accepting networks of bio-inspired processors: networks of evolutionary processors, networks of splicing processors and networks of genetic processors. And, secondly, we survey some features of these networks: computational power, computational and descriptional complexity, the existence of universal networks, eciency as problem solvers and the relationships among them

Parallel algorithm for P Systems implementation in multiprocessors

PARALLEL ALGORITHM FOR P SYSTEMS IMPLEMENTATION IN MULTIPROCESSOR

Plan de Acción Tutorial en la Escuela Universitaria de Informática de la Universidad Politécnica de Madrid

Aquest article presenta un model d’acció tutorial desenvolupat sobre estratègies d’acompanyament a l’estudiant basades en “coaching” i intel•ligència emocional, i un model experimental de tutories per parells de tutors en els que es celebren sessions conjuntes per tractar problemes comuns i compartir experiències dels tutelats. Els resultats obtinguts d’integració i eficiència en el procés d’ensenyança aprenentatge dels tutelats en aquest model inviten a estendre l’experiència a un grup de tutors major per després generalitzar-lo.This paper presents a tutorial action model oriented to help students through both the development of some new strategies based on coaching and “emotional intelligence”, and the use of an experimental model of tutoring by pairs of tutors. Joint meetings of the students of both tutors are conducted, to deal with common problems and share students’ experiences. The results obtained from this integration and the efficiency in the learning process of the tutored students in this model, invite us to extend the experience to a larger group of tutors, and then try to generalize it.Este artículo presenta un modelo de acción tutorial desarrollado sobre estrategias de acompañamiento al estudiante basadas en “coaching” e inteligencia emocional, y un modelo experimental de tutorías por pares de tutores en los que se celebran sesiones conjuntas para tratar problemas comunes y compartir experiencias de los tutelados. Los resultados obtenidos de integración y eficiencia en el proceso de enseñanza aprendizaje de los tutelados en este modelo invitan a extender la experiencia a un grupo de tutores mayor para después generalizarlo